JAF26/Weak Arithmetics Days Seville, June 11–13, 2007 Self-applied proof verification (Extended abstract)?

Source URL: www.multimedialibrary.com

• Philosophical logic
• Model theory
• Predicate logic
• Metalogic
• Mathematical proof
• Kripke semantics
• Correctness
• Quantification
• Function
• Logic
• Mathematics
• Mathematical logic

MaSh: Machine Learning for Sledgehammer Daniel Kühlwein1 , Jasmin Christian Blanchette2 , Cezary Kaliszyk3 , and Josef Urban1 1 2

Source URL: www21.in.tum.de

• Automated theorem proving
• Logic in computer science
• Model theory
• Formal methods
• Proof theory
• Proof assistant
• Isabelle
• Automated reasoning
• Mathematical proof
• Theoretical computer science
• Mathematics
• Mathematical logic

Redirecting Proofs by Contradiction Jasmin Christian Blanchette Technische Universität München, Germany Abstract This paper presents an algorithm that redirects proofs by contradiction. The input is a refutation graph,

Source URL: www21.in.tum.de

• Proof theory
• Automated theorem proving
• Rules of inference
• Mathematical proofs
• Sequent
• Natural deduction
• Proof by contradiction
• Resolution
• First-order logic
• Logic
• Mathematics
• Mathematical logic

All Finite Fields Have a Prime-Power Order Morphisms, Cauchy’s Theorem, and Proof of Theorem Daniel R. Page, 2011 (Updated December 20, 2012) Morphisms are a powerful tool in proving properties of mathematical objects

Source URL: www.pagewizardgames.com

• Field theory
• Morphisms
• Niels Henrik Abel
• Finite field
• Abelian group
• Automorphism
• Order
• Field
• Group homomorphism
• Abstract algebra
• Algebra
• Group theory

A family of types that fail to be provably collapsible 1st April 2013 This note is an informal proof in MLTT (intensional Martin-L¨of type theory), with a conclusion about MLTT, of material developed formally in Agda no

Source URL: www.cs.bham.ac.uk

An Introduction to Program Verification with the Coq Proof Assistant NII Lectures Series Fr´ed´eric Loulergue

Source URL: www.nii.ac.jp

• Mathematical logic
• Proof theory
• Dependently typed programming
• Lambda calculus
• Logic in computer science
• Coq
• Curry–Howard correspondence
• Natural deduction
• Dependent type
• Programming language theory
• Type theory
• Mathematics

Notes from the logbook of a proof-checher’s project? Domenico Cantone1 , Eugenio G. Omodeo2 , Jacob T. Schwartz3 , Pietro Ursino1 1 3

Source URL: www.multimedialibrary.com

• Function
• Injective function
• Constructible universe
• Computability theory
• Μ-recursive function
• Fréchet derivative
• Mathematics
• Mathematical analysis
• Functions and mappings

The Ref proof-checker and its “common shared scenario” Eugenio G. Omodeo December 3, 2011 · · · l’histoire g´eologique nous montre que la vie n’est qu’un court ´episode entre deux ´eternit´es de mort, et

Source URL: www.multimedialibrary.com

• Function
• Automata theory
• Computability theory
• Theory of computation
• COMPASS/Sample Code
• IIHF World U18 Championships – Division II
• Mathematics
• Functions and mappings
• Constructible universe

Under consideration for publication in J. Functional Programming 1 Parametricity, Type Equality and Higher-order Polymorphism

Source URL: www.cis.upenn.edu

• Mathematics
• Computer science
• Curry–Howard correspondence
• Dependently typed programming
• Philosophy of computer science
• Parametricity
• Logic
• Type theory
• Proof theory
• Logic in computer science

Do the Integers Exist? The Unknowability of Arithmetic Consistency JACK T. SCHWARTZ Courant Institute It is an article of faith for most mathematicians that Peano’s axioms for arithmetic are consistent, perhaps becaus

Source URL: www.multimedialibrary.com

• Axiom
• Mathematical proof
• Foundations of mathematics
• Peano axioms
• Kurt Gödel
• Contradiction
• Zermelo–Fraenkel set theory
• Theorem
• Gottlob Frege
• Logic
• Mathematics
• Mathematical logic